Incrementalized pointer and escape analysis

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositional Pointer and Escape Analysis for Multithreaded Java Programs

This paper presents a new combined pointer and escape analysis algorithm for Java programs with unstructured multithreading. The algorithm is based on the abstraction of parallel interaction graphs, which characterize the points-to and escape relationships between objects and the ordering relationships between actions performed by multiple parallel threads. To our knowledge, this algorithm is t...

متن کامل

Simulation and perturbation analysis of escape oscillator

The dynamical behaviour of the forced escape oscillator, which depends on the parameter values we considered, have been studied numerically using the techniques of phase portraits and Poincar'{e} sections. Also, we employed perturbation methods such as Lindstedt's method to obtain the frequency-amplitude relation of escape oscillator.

متن کامل

Pointer Analysis

Pointer analysis is a fundamental static program analysis, with a rich literature and wide applications. The goal of pointer analysis is to compute an approximation of the set of program objects that a pointer variable or expression can refer to. We present an introduction and survey of pointer analysis techniques, with an emphasis on distilling the essence of common analysis algorithms. To thi...

متن کامل

Interprocedural Pointer Analysis for C Interprocedural Pointer Analysis for C

Interprocedural pointer analysis provides information on the values pointer variables may have at various points in a program. It is especially useful in languages like C, where pointers are extensively used. This analysis does not improve code directly but is used by other optimizations. This paper presents a framework in which to perform pointer analysis. Basic questions that any pointer anal...

متن کامل

Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis

Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. However, current inclusion-based analyses can have prohibitive costs in time and space, especially for programs with millions of lines of code. We present a suite of offline optimizations that exploit pointer and location equival...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 2001

ISSN: 0362-1340,1558-1160

DOI: 10.1145/381694.378804